The $\Pi^0_2$-Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity)
Identifieur interne : 003887 ( Main/Exploration ); précédent : 003886; suivant : 003888The $\Pi^0_2$-Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity)
Auteurs : Jakob Grue Simonsen [Danemark]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: Most of the standard pleasant properties of term rewriting systems are undecidable; to wit: local confluence, confluence, normalization, termination, and completeness. Mere undecidability is insufficient to rule out a number of possibly useful properties: For instance, if the set of normalizing term rewriting systems were recursively enumerable, there would be a program yielding “yes” in finite time if applied to any normalizing term rewriting system. The contribution of this paper is to show (the uniform version of) each member of the list of properties above (as well as the property of being a productive specification of a stream) complete for the class $\Pi^0_2$ . Thus, there is neither a program that can enumerate the set of rewriting systems enjoying any one of the properties, nor is there a program enumerating the set of systems that do not. For normalization and termination we show both the ordinary version and the ground versions (where rules may contain variables, but only ground terms may be rewritten) $\Pi^0_2$ -complete. For local confluence, confluence and completeness, we show the ground versions $\Pi^0_2$ -complete.
Url:
DOI: 10.1007/978-3-642-02348-4_24
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003765
- to stream Istex, to step Curation: 003722
- to stream Istex, to step Checkpoint: 000994
- to stream Main, to step Merge: 003965
- to stream Main, to step Curation: 003887
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">The $\Pi^0_2$-Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity)</title><author><name sortKey="Simonsen, Jakob Grue" sort="Simonsen, Jakob Grue" uniqKey="Simonsen J" first="Jakob Grue" last="Simonsen">Jakob Grue Simonsen</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:E83E6BB9A50F084B40835F8CF5369C4209707348</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1007/978-3-642-02348-4_24</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-654K1SFB-5/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003765</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003765</idno><idno type="wicri:Area/Istex/Curation">003722</idno><idno type="wicri:Area/Istex/Checkpoint">000994</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000994</idno><idno type="wicri:doubleKey">0302-9743:2009:Simonsen J:the:pi:completeness</idno><idno type="wicri:Area/Main/Merge">003965</idno><idno type="wicri:Area/Main/Curation">003887</idno><idno type="wicri:Area/Main/Exploration">003887</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">The <formula xml:id="IEq1" notation="TEX"><media mimeType="image" url=""></media>$\Pi^0_2$
</formula>-Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity)</title><author><name sortKey="Simonsen, Jakob Grue" sort="Simonsen, Jakob Grue" uniqKey="Simonsen J" first="Jakob Grue" last="Simonsen">Jakob Grue Simonsen</name><affiliation wicri:level="1"><country xml:lang="fr">Danemark</country><wicri:regionArea>Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100, Copenhagen Ø</wicri:regionArea><wicri:noRegion>Copenhagen Ø</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Danemark</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Most of the standard pleasant properties of term rewriting systems are undecidable; to wit: local confluence, confluence, normalization, termination, and completeness. Mere undecidability is insufficient to rule out a number of possibly useful properties: For instance, if the set of normalizing term rewriting systems were recursively enumerable, there would be a program yielding “yes” in finite time if applied to any normalizing term rewriting system. The contribution of this paper is to show (the uniform version of) each member of the list of properties above (as well as the property of being a productive specification of a stream) complete for the class $\Pi^0_2$ . Thus, there is neither a program that can enumerate the set of rewriting systems enjoying any one of the properties, nor is there a program enumerating the set of systems that do not. For normalization and termination we show both the ordinary version and the ground versions (where rules may contain variables, but only ground terms may be rewritten) $\Pi^0_2$ -complete. For local confluence, confluence and completeness, we show the ground versions $\Pi^0_2$ -complete.</div></front></TEI><affiliations><list><country><li>Danemark</li></country></list><tree><country name="Danemark"><noRegion><name sortKey="Simonsen, Jakob Grue" sort="Simonsen, Jakob Grue" uniqKey="Simonsen J" first="Jakob Grue" last="Simonsen">Jakob Grue Simonsen</name></noRegion><name sortKey="Simonsen, Jakob Grue" sort="Simonsen, Jakob Grue" uniqKey="Simonsen J" first="Jakob Grue" last="Simonsen">Jakob Grue Simonsen</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003887 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 003887 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:E83E6BB9A50F084B40835F8CF5369C4209707348
|texte= The $\Pi^0_2$-Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity)
}}
| This area was generated with Dilib version V0.6.33. |  |